Asymptotics of the Euler number of bipartite graphs
نویسندگان
چکیده
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملThe Choice Number of Random Bipartite Graphs
A random bipartite graph G n n p is obtained by taking two disjoint subsets of vertices A and B of cardinality n each, and by connecting each pair of vertices a ! A and b ! B by an edge randomly and independently with probability p " p n . We show that the choice number of G n n p is, almost surely, 1 # o 1 log2 np for all values of the edge probability p " p n , where the o 1 term tends to 0 a...
متن کاملOn The Number Of Unlabeled Bipartite Graphs
Let I and O denote two sets of vertices, where I ∩ O = Φ, |I| = n, |O| = r, and Bu(n, r) denote the set of unlabeled graphs whose edges connect vertices in I and O. It is shown that the following two-sided equality holds. ( r+2n−1 r ) n! ≤ |Bu(n, r)| ≤ 2 ( r+2n−1 r )
متن کاملThe α-labeling number of bipartite graphs
In this paper, we study the a-labeling number GO'. of a bipartite graph G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2010
ISSN: 0196-8858
DOI: 10.1016/j.aam.2009.05.002